A Characterisation of Virtually Free Groups
نویسندگان
چکیده
We prove that a finitely generated group G is virtually free if and only if there exists a generating set for G and k > 0 such that all k-locally geodesic words with respect to that generating set are geodesic.
منابع مشابه
On trivial ends of Cayley graph of groups
In this paper, first we introduce the end of locally finite graphs as an equivalence class of infinite paths in the graph. Then we mention the ends of finitely generated groups using the Cayley graph. It was proved that the number of ends of groups are not depended on the Cayley graph and that the number of ends in the groups is equal to zero, one, two, or infinity. For ...
متن کاملWhen is a Graph Product of Groups Virtually-Free?
Those graph products of groups that are virtually-free are characterized.
متن کاملA Topological Characterisation of Hyperbolic Groups
The notion of a hyperbolic group was introduced by Gromov [Gr]. Associated to any hyperbolic group, Γ, is its boundary, ∂Γ. This is a metrisable compactum on which Γ acts by homeomorphism. If Γ is non-elementary (i.e. not finite or virtually cyclic), then ∂Γ is perfect. The induced action of Γ on the space of distinct triples of ∂Γ is properly discontinuous and cocompact. The main result of thi...
متن کاملOn the Automorphism Group of Generalized Baumslag-solitar Groups
A generalized Baumslag-Solitar group (GBS group) is a finitely generated group G which acts on a tree with all edge and vertex stabilizers infinite cyclic. We show that Out(G) either contains non-abelian free groups or is virtually nilpotent of class ≤ 2. It has torsion only at finitely many primes. One may decide algorithmically whether Out(G) is virtually nilpotent or not. If it is, one may d...
متن کاملGroups with Context-Free Conjugacy Problems
The conjugacy problem and the inverse conjugacy problem of a finitely generated group are defined, from a language theoretic point of view, as sets of pairs of words. An automaton might be obliged to read the two input words synchronously, or could have the option to read asynchronously. Hence each class of languages gives rise to four classes of groups; groups whose (inverse) conjugacy problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006